Equations on Timed Languages
نویسنده
چکیده
We continue investigation of languages, accepted by timed automata of Alur and Dill. In [ACM97] timed regular expressions equivalent to timed automata were introduced. Here we introduce quasilinear equations over timed languages with regular coefficients. We prove that the minimal solution of such an equation is regular and give an algorithm to calculate this solution. This result is used to obtain a new proof of Kleene theorem ([ACM97]) for timed automata. Equations over timed languages can be also considered as an alternative way of specifying these languages.
منابع مشابه
Generating Functions of Timed Languages
In order to study precisely the growth of timed languages, we associate to such a language a generating function. These functions (tightly related to volume and entropy of timed languages) satisfy compositionality properties and, for deterministic timed regular languages, can be characterized by integral equations. We provide procedures for closed-form computation of generating functions for so...
متن کاملExtended Timed Alternating Finite Automata: Revisited
In this paper, we continue to investigate timed alternating finite automata (TAFA), in particular we generalize the existing theory to the case of extended timed alternating finite automata (ETAFA). We define a framework extension of TAFA, study their power and properties. We develop an algebraic treatment of such ETAFA, along the lines of the algebraic treatment of systems of equations based o...
متن کاملPre - Proceedings of the 3 rd International Conference on Formal Modelling and Analysis of Timed Systems
This paper attempts to improve our understanding of timed languages and their relation to timed automata. We start by giving a constructive proof of the folk theorem stating that timed languages specified by the past fragment of MITL, can be accepted by deterministic timed automata. On the other hand we provide a proof that certain languages expressed in the future fragment of MITL are not dete...
متن کاملDiscretization of Timed Automata in Timed μCRL à la Regions and Zones
We present the first step towards combining the best parts of the real-time verification methods based on timed automata (the use of regions and zones), and of the process-algebraic approach of languages like LOTOS and μCRL. μCRL targets the specification of system behavior in a process-algebraic (ACP) style and deals with data elements in the form of abstract data types. A timed automata speci...
متن کاملA Perfect Class of Context-Sensitive Timed Languages
Perfect languages—a term coined by Esparza, Ganty, and Majumdar—are the classes of languages that are closed under Boolean operations and enjoy decidable emptiness problem. Perfect languages form the basis for decidable automata-theoretic model-checking for the respective class of models. Regular languages and visibly pushdown languages are paradigmatic examples of perfect languages. Alur and D...
متن کامل